Four Shortest Vertex-Disjoint Paths in Planar Graphs
نویسنده
چکیده
Let G be an edge-weighted planar graph with 2k terminal vertices 5 s1, t1, . . . , sk, tk. The minimum-sum vertex-disjoint paths problem asks for a set of 6 pairwise vertex-disjoint simple paths of minimum total length, where the ith path 7 connects si to ti. Even when all terminals lie on a single face, efficient algorithms 8 for this problem are known only for fixed k ≤ 3. We describe the first polynomial9 time algorithm for the case of four arbitrary terminal pairs on a single face. 10
منابع مشابه
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path from si to ti for each i = 1, . . . , k. In the corresponding optimization problem, the shortest disjoint paths problem, the vertex-disjoint paths Pi have to be chosen such that a given objective function is minimized. We...
متن کاملTowards single face shortest vertex - disjoint paths in undirected 1 planar graphs
7 Given k pairs of terminals {(s1, t1), . . . , (sk, tk)} in a graph G, the min-sum k vertex-disjoint 8 paths problem is to find a collection {Q1, Q2, . . . , Qk} of vertex-disjoint paths with minimum 9 total length, where Qi is an si-to-ti path between si and ti. We consider the problem in 10 planar graphs, where little is known about computational tractability, even in restricted cases. 11 Ko...
متن کاملTowards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
Given k pairs of terminals {(s1, t1), . . . , (sk, tk)} in a graph G, the min-sum k vertex-disjoint paths problem is to find a collection {Q1, Q2, . . . , Qk} of vertex-disjoint paths with minimum total length, where Qi is an si-to-ti path between si and ti. We consider the problem in planar graphs, where little is known about computational tractability, even in restricted cases. Kobayashi and ...
متن کاملImproved Bounds for Shortest Paths in Dense Distance Graphs
We study the problem of computing shortest paths in so-called dense distance graphs. Every planar graph G on n vertices can be partitioned into a set of O(n/r) edge-disjoint regions (called an r-division) with O(r) vertices each, such that each region has O( √ r) vertices (called boundary vertices) in common with other regions. A dense distance graph of a region is a complete graph containing a...
متن کاملLinear - Time Algorithms for Disjoint Two - Face PathsProblems
In this paper we present a linear-time algorithm for the vertex-disjoint Two-Face Paths Problem in planar graphs, i.e., the problem of nding k vertex-disjoint paths between pairs of terminals which lie on two face boundaries. The algorithm is based on the idea of nding rightmost paths with a certain property in planar graphs. Using this method, a linear-time algorithm for nding vertex-disjoint ...
متن کامل